Перевод: с английского на русский

с русского на английский

table of prime numbers

См. также в других словарях:

  • Table of prime factors — The tables contain the prime factorization of the natural numbers from 1 to 1000.When n is a prime number, the prime factorization is just n itself, written in bold below.The number 1 is called a unit. It has no prime factors and is neither prime …   Wikipedia

  • List of prime numbers — This is an incomplete list, which may never be able to satisfy particular standards for completeness. You can help by expanding it with reliably sourced entries. By Euclid s theorem, there are an infinite number of prime numbers. Subsets of the… …   Wikipedia

  • Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… …   Wikipedia

  • Prime number theorem — PNT redirects here. For other uses, see PNT (disambiguation). In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers. The prime number theorem gives a general description of how the primes are… …   Wikipedia

  • Prime-counting function — In mathematics, the prime counting function is the function counting the number of prime numbers less than or equal to some real number x cite book |first=Eric |last=Bach |coauthors=Shallit, Jeffrey |year=1996 |title=Algorithmic Number Theory… …   Wikipedia

  • prime number theorem — Math. the theorem that the number of prime numbers less than or equal to a given number is approximately equal to the given number divided by its natural logarithm. [1660 70] * * * ▪ mathematics  formula that gives an approximate value for the… …   Universalium

  • Table of divisors — The tables below list all of the divisors of the numbers 1 to 1000.A divisor of an integer n is an integer m , say, for which n / m is again an integer (which is necessarily also a divisor of n ). For example, 3 is a divisor of 21, since 21/3 = 7 …   Wikipedia

  • Prime factor — In number theory, the prime factors of a positive integer are the prime numbers that divide into that integer exactly, without leaving a remainder. The process of finding these numbers is called integer factorization, or prime factorization.For a …   Wikipedia

  • Table manners — Part of a series on Meals …   Wikipedia

  • Mersenne prime — Named after Marin Mersenne Publication year 1536[1] Author of publication Regius, H. Number of known terms 47 Conjectured number of terms Infinite …   Wikipedia

  • Great Internet Mersenne Prime Search — The Great Internet Mersenne Prime Search (GIMPS) is a collaborative project of volunteers who use freely available computer software to search for Mersenne prime numbers. The project was founded by George Woltman, who also wrote the software… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»